A non-commutative algorithm for multiplying (7 $\times$ 7) matrices using 250 multiplications
نویسنده
چکیده
We present a non-commutative algorithm for multiplying (7x7) matrices using 250 multiplications and a non-commutative algorithm for multiplying (9x9) matrices using 520 multiplications. These algorithms are obtained using the same divide-and-conquer technique.
منابع مشابه
A non-commutative algorithm for multiplying 5 $\times$ 5 matrices using 99 multiplications
We present a non-commutative algorithm for multiplying $5 \times 5$ matrices using 99 multiplications. This algorithm is a minor modification of Makarov algorithm [4].
متن کاملOn the arithmetic complexity of Strassen-like matrix multiplications
The Strassen algorithm for multiplying 2× 2 matrices requires seven multiplications and 18 additions. The recursive use of this algorithm for matrices of dimension n yields a total arithmetic complexity of (7n2.81− 6n2) for n = 2k. Winograd showed that using seven multiplications for this kind of multiplications is optimal, so any algorithm for multiplying 2 × 2 matrices with seven multiplicati...
متن کاملSub Tasks Matrix Multiplication Algorithm (STMMA)
Several parallel matrix multiplications developed since four decades based on decomposing the multiplied matrices into smaller size blocks, the blocks will be distributed among the processors to run matrix multiplication in shorter time than when only one processor will run the whole matrix multiplications. All parallel matrix multiplications algorithms suffer from three points: C The optimal s...
متن کاملA New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications
One of the most famous conjectures in computer algebra is that matrix multiplication might be feasible in nearly quadratic time, [8]. The best known exponent is 2.376, due to Coppersmith and Winograd [9]. Many attempts to solve this problems in the literature work by solving, fixed-size problems and then apply the solution recursively [6,22,17,21,2]. This leads to pure combinatorial optimisatio...
متن کاملThe Border Rank of the Multiplication of 2× 2 Matrices Is Seven
One of the leading problems of algebraic complexity theory is matrix multiplication. The näıve multiplication of two n× n matrices uses n multiplications. In 1969 Strassen [19] presented an explicit algorithm for multiplying 2 × 2 matrices using seven multiplications. In the opposite direction, Hopcroft and Kerr [11] and Winograd [20] proved independently that there is no algorithm for multiply...
متن کامل